Interacted Multiple Ant Colonies Optimization Approach to Enhance the Performance of Ant Colony Optimization Algorithms
نویسندگان
چکیده
One direction of ant colony optimization researches is dividing the ants’ population into several colonies. These colonies work together to collectively solve an optimization problem. This approach offers good opportunity to explore a large area of the search space. This paper proposes a new generic algorithmic approach that utilized multiple ant colonies with several new interaction techniques. Computational test shows promising results of the new approach. The proposed approach outperforms the single colony ant algorithms in term of solution quality with the same computational effort.
منابع مشابه
An Experimental Study of the Search Stagnation in Ants Algorithms
This paper conducts experimental tests to study the stagnation behavior the Interacted Multiple Ant Colonies Optimization (IMACO) framework. The idea of different ant colonies use different types of problem dependent heuristics has been proposed as well. The performance of IMACO was demonstrated by comparing it with the Ant Colony System (ACS) the best performing ant algorithm. The computationa...
متن کاملInteracted Multiple Ant Colonies Optimization Framework: an Experimental Study of the Evaluation and the Exploration Techniques to Control the Search Stagnation
Search stagnation is a serious problem that all Ant Colony Optimization (ACO) algorithms suffer from regardless of their application domain. The framework of Interacted Multiple Ant Colonies Optimization (IMACO) is a recent proposition. It divides the ants’ population into several colonies and employs certain techniques to organize the work of these colonies. This paper proposes new effective e...
متن کاملFORCED WATER MAIN DESIGN MIXED ANT COLONY OPTIMIZATION
Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملA Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers
Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer and Information Science
دوره 3 شماره
صفحات -
تاریخ انتشار 2010